Parallel Matrix Multiplication on a Linear Array with a Reconfigurable Pipelined Bus System
نویسندگان
چکیده
The known fast sequential algorithms for multiplying two N N matrices (over an arbitrary ring) have time complexity O(N ), where 2 < < 3. The current best value of is less than 2.3755. We show that for all 1 p N , multiplying two N N matrices can be performed on a p-processor linear array with a reconfigurable pipelined bus system (LARPBS) in O(N =p + (N=p ) log p) time. This is currently the fastest parallelization of the best known sequential matrix multiplication algorithm on a distributed memory parallel system.
منابع مشابه
Fast and Processor Efficient Parallel Matrix Multiplication Algorithms on a Linear Array With a Reconfigurable Pipelined Bus System
We present efficient parallel matrix multiplication algorithms for linear arrays with reconfigurable pipelined bus systems (LARPBS). Such systems are able to support a large volume of parallel communication of various patterns in constant time. An LARPBS can also be reconfigured into many independent subsystems and, thus, is able to support parallel implementations of divide-and-conquer computa...
متن کاملParallel Matrix Multiplication on a Linear Array with a Reconngurable Pipelined Bus System Parallel Matrix Multiplication on a Linear Array with a Reconngurable Pipelined Bus System
The known fast sequential algorithms for multiplying two N N matrices (over an arbitrary ring) have time complexity O(N), where 2 < < 3. The current best value of is less than 2.3755. We show that for all 1 p N , multiplying two N N matrices can be performed on a p-processor linear array with a reconngurable pipelined bus system (LARPBS) in O N p + N 2 p 2== log p time. This is currently the fa...
متن کاملParallel Matrix Multiplication on a Linear Array with a Recon gurable Pipelined Bus System
The known fast sequential algorithms for multiplying two N N matrices over an arbitrary ring have time complexity O N where The current best value of is less than We show that for all p N multiplying two N N matrices can be performed on a p processor linear array with a recon gurable pipelined bus system LARPBS in
متن کاملImpact of Parallelism on Dualcore
1. Keqin L., Yi P., Si Qing Z.,”Fast and Processor Efficient Parallel Matrix Multiplication Algorithms on a Linear Array With a Reconfigurable Pipelined Bus System”, IEEE Transaction on parallel and distributed, VOL. 9, AUG 1998, pp 705-720. 2. Cameron, H., Tracy, H., Professional Multicore programming, Wiley publication,2008. 3. Venkatesan P., Harish B., S. Sarholz, Proceedings of the 3rd inte...
متن کاملSolving Graph Theory Problems Using Reconfigurable Pipelined Optical Buses
We solve a number of important and interesting problems from graph theory on a linear array with a recon gurable pipelined optical bus system. Our algorithms are based on fast matrix multiplication and extreme value nding algorithms, and are currently the fastest algorithms. We also distinguish the two cases where weights have bounded/unbounded magnitude and precision.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Computers
دوره 50 شماره
صفحات -
تاریخ انتشار 1999